An Eclipse-based environment for conformance testing by FSMs

نویسندگان

  • Angelo Gargantini
  • Marco Guarnieri
  • Eros Magri
چکیده

Finite state machines (FSMs) represent a very simple yet widely used formalism. They are used to model simple protocols or even complex systems in an abstract way. Java classes often behave like FSMs. For these reasons, FSMs are often used in conformance testing, which consists in checking that a real implementation conforms with its speci cation given in terms of a FSM. In this paper, we show how Eclipserelated technologies, like GMF and PDE, can be used to build an editor and test generator for FSMs. We present a complete environment which contains: (1) a graphical editor based on a metamodel for FSMs, (2) an extensible framework for test generation from FSMs according to several coverage criteria, and (3) an API that can be used to test Java classes against their speci cations given as FSMs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling basic LOTOS by FSMs for conformance testing

A challenging issue is the derivation of a nite test suite from a given LOTOS speci cation modeled by a labeled transition system (LTS) such that complete fault coverage is guaranteed for a certain class of implementations with respect to a particular conformance relation. It is shown in this paper that this problem can be solved by translating an LTS into an input/output nite state machine (FS...

متن کامل

Distinguing Non-deterministic Timed Finite State Machines

Conformance testing with the guaranteed fault coverage is based on distinguishing faulty system implementations from the corresponding system specification. We consider timed systems modeled by timed possibly nondeterministic finite state machines (TFSMs) and propose algorithms for distinguishing two TFSMs. In particular, we present a preset algorithm for separating two separable TFSMs and an a...

متن کامل

A Conformance Testing Method for Communication Protocols Modeled as Concurrent DFSMs

According to the progress of high-speed networks, many communication protocols are specified as concurrent systems. Such systems can be modeled as concurrent deterministic FSMs (DFSMs). In those protocols, a common input may be taken by some of concurrent DFSMs competitively. In such a case, the global behaviour becomes non-deterministic in general. Conformance testing is typically a black-box ...

متن کامل

Testing deterministic implementations from nondeterministic FSM specifications

In this paper, conformance testing of protocols specified as nondeterministic finite state machines is considered. Protocol implementations are assumed to be deterministic. In this testing scenario, the conformance relation becomes a preorder, so-called reduction relation between FSMs. The reduction relation requires that an implementation machine produces a (sub)set of output sequences that ca...

متن کامل

Fault Model-Driven Test Derivation from Finite State Models: Annotated Bibliography

The annotated bibliography highlights work in the area of algorithmic test generation from formal speci cations with guaranteed fault coverage, i.e., fault model-driven test derivation. A fault model is understood as a triple, comprising a nite state speci cation, conformance relation and fault domain that is the set of possible implementations. The fault model can be specialized to Input/Outpu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011